Functional central limit theorems for a large network in which customers join the shortest of several queues
نویسنده
چکیده
We considerN single server infinite buffer queues with service rate β. Customers arrive at rate Nα, choose L queues uniformly, and join the shortest. We study the processes t ∈ R+ 7→ R t = (R t (k))k∈N for large N , where R t (k) is the fraction of queues of length at least k at time t. Laws of large numbers (LLNs) are known, see Vvedenskaya et al. [15], Mitzenmacher [12] and Graham [5]. We consider certain Hilbert spaces with the weak topology. First, we prove a functional central limit theorem (CLT) under the a priori assumption that the initial data R 0 satisfy the corresponding CLT. We use a compactness-uniqueness method, and the limit is characterized as an Ornstein-Uhlenbeck (OU) process. Then, we study the R in equilibrium under the stability condition α < β, and prove a functional CLT with limit the OU process in equilibrium. We use ergodicity and justify the inversion of limits limN→∞ limt→∞ = limt→∞ limN→∞ by a compactnessuniqueness method. We deduce a posteriori the CLT for R 0 under the invariant laws, an interesting result in its own right. The main tool for proving tightness of the implicitly defined invariant laws in the CLT scaling and ergodicity of the limit OU process is a global exponential stability result for the nonlinear dynamical system obtained in the functional LLN limit. Key-words: Mean-field interaction, load balancing, resource pooling, ergodicity, non-equilibrium fluctuations, equilibrium fluctuations, birth and death processes, spectral gap, global exponential stability MSC2000: Primary: 60K35. Secondary: 60K25, 60B12, 60F05, 37C75, 37A30. March 25, 2004.
منابع مشابه
Functional Central Limit Theorems for a Large Network in Which Customers Join the Shortest of Several Queues Functional Central Limit Theorems for a Large Network in Which Customers Join the Shortest of Several Queues
We considerN single server infinite buffer queues with service rate β. Customers arrive at rateNα, choose L queues uniformly, and join the shortest. We study the processes t ∈ R+ 7→ R t = (R t (k))k∈N for large N , where R t (k) is the fraction of queues of length at least k at time t. Laws of large numbers (LLNs) are known, see Vvedenskaya et al. [15], Mitzenmacher [12] and Graham [5]. We cons...
متن کاملA functional central limit theorem in equilibrium for a large network in which customers join the shortest of several queues
متن کامل
2 00 3 Out of equilibrium functional central limit theorems for a large network where customers join
Customers arrive at rate N α on a network of N single server infinite buffer queues, choose L queues uniformly, join the shortest one, and are served there in turn at rate β. We let N go to infinity. We prove a functional central limit theorem (CLT) for the tails of the empirical measures of the queue occupations, in a Hilbert space with the weak topology, with limit given by an Ornstein-Uhlenb...
متن کاملOut of equilibrium functional central limit theorems for a large network where customers join the shortest of several queues
Customers arrive at rate Nα on a network of N single server infinite buffer queues, choose L queues uniformly, join the shortest one, and are served there in turn at rate β. We let N go to infinity. We prove a functional central limit theorem (CLT) for the tails of the empirical measures of the queue occupations, in a Hilbert space with the weak topology, with limit given by an Ornstein-Uhlenbe...
متن کامل2 00 3 A functional central limit theorem in equilibrium for a large network in which customers join the shortest of several queues
We consider N single server infinite buffer queues with service rate β. Customers arrive at rate N α, choose L queues uniformly, and join the shortest one. The stability condition is α < β. We study in equilibrium the fraction of queues of length at least k ≥ 0. We prove a functional central limit theorem on an infinite-dimensional Hilbert space with its weak topology, with limit a stationary O...
متن کامل